Computational methods for finding long simple cycles in complex networks
نویسندگان
چکیده
منابع مشابه
Finding long cycles in graphs
We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechanics and relies on a message passing procedure. The second follows a more standard Monte Carlo Markov chain strategy. Special attention is devoted to Hamiltonian cycles of (nonregular) random graphs of minimal connectiv...
متن کاملFinding simple paths and cycles in graphs
We describe a novel method, the method of random colorings, for finding simple paths and cycles of a specified length k in a graph G = (V,E). Using small bias probability spaces and families of perfect hash functions we can derandomize the randomized algorithms obtained using this method and obtain deterministic algorithms that establish the following new results: • For every fixed k, deciding ...
متن کاملOn a Simple Randomized Algorithm for Finding Long Cycles in Sparse Graphs
We analyze the performance of a simple randomized algorithm for finding long cycles and 2-factors in directed Hamiltonian graphs of out-degree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2-factor in O(n) expected time. The analysis of our algorithm is based on random walks on a line and interestingly resembles the analys...
متن کاملFinding k Simple Shortest Paths and Cycles
We present algorithms and hardness results for several problems related to finding multiple simple shortest paths in a graph. Our main result is a new algorithm for finding k simple shortest paths for all pairs of vertices in a weighted directed graph G = (V,E). For k = 2 our algorithm runs in O(mn + n logn) time where m and n are the number of edges and vertices in G. Our approach is based on ...
متن کاملFinding cycles in hierarchical hypercube networks
a r t i c l e i n f o a b s t r a c t The hierarchical hypercube network, which was proposed as an alternative to the hypercube, is suitable for building a large-scale multiprocessor system. A bipartite graph G = (V , E) is bipancyclic if it contains cycles of all even lengths ranging from 4 to |V |. In this paper, we show that the hierarchical hypercube network is bipancyclic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2017
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2017.03.022